Voer een woord of zin in in een taal naar keuze 👆
Taal:
Vertaling en analyse van woorden door kunstmatige intelligentie ChatGPT
Op deze pagina kunt u een gedetailleerde analyse krijgen van een woord of zin, geproduceerd met behulp van de beste kunstmatige intelligentietechnologie tot nu toe:
- hoe het woord wordt gebruikt
- gebruiksfrequentie
- het wordt vaker gebruikt in mondelinge of schriftelijke toespraken
- opties voor woordvertaling
- Gebruiksvoorbeelden (meerdere zinnen met vertaling)
- etymologie
polynomial time complexity - vertaling naar russisch
COMPUTATIONAL COMPLEXITY CLASS OF PROBLEMS SOLVABLE BY A DETERMINISTIC TURING MACHINE IN POLYNOMIAL TIME
PTIME; Nonuniform polynomial-time; Nonuniform polynomial time; AL (complexity); P (complexity class); Complexity class P; P-hard; P (class)
![PH]], and [[PSPACE]]](https://commons.wikimedia.org/wiki/Special:FilePath/Complexity-classes-polynomial.svg?width=200 "PH]], and [[PSPACE]]")
![PP]]), allwithin [[PSPACE]]. It is unknown if any of these containments are strict.](https://commons.wikimedia.org/wiki/Special:FilePath/Randomised Complexity Classes 2.svg?width=200 "PP]]), allwithin [[PSPACE]]. It is unknown if any of these containments are strict.")
polynomial time complexity
полиномиально-временная сложность
class NP
COMPUTATIONAL COMPLEXITY CLASS OF DECISION PROBLEMS SOLVABLE BY A NON-DETERMINISTIC TURING MACHINE IN POLYNOMIAL TIME
NP (complexity class); Nondeterministic polynomial time; NP-problem; NP-Problem; NP class; NP Class; NP-Class; NP-class; Class NP; Complexity class NP; Nondeterministic Polynomial; Nondeterministic polynomial; Np (complexity); NP (class)
класс NP, класс трудных задач, решаемых в полиномиальное время недетерминированным алгоритмом
polynomial complexity
ESTIMATE OF TIME TAKEN FOR RUNNING AN ALGORITHM
Polynomial time; Exponential time; Linearithmic function; Subquadratic time; Running time; Linear time; Cubic time; Quadratic time; Algorithmic time complexity; Polynomial-time; Polynomial-time algorithm; Polynomial-time solutions; Polynomial-time solution; Computation time; Constant time; Exponential algorithm; Logarithmic time; Linear-time; Linearithmic; N log n; Weakly polynomial; Strongly polynomial; Run-time complexity; Sublinear time; Sublinear-time; Sublinear time algorithm; Linearithm; Computational time; Sub-exponential time; Super-polynomial time; Superpolynomial; Fast algorithms; Quasi-polynomial time; SUBEXP; Linearithmic time; Double exponential time; Polylogarithmic time; Sub-linear time; Polynomial time algorithm; Subexponential time; Nlogn; Quasilinear time; Strongly polynomial time; Polynomial complexity; Linear-time algorithm; Linear time agorithm; Sublinear algorithm; Polytime; Weakly polynomial time algorithm; Time complexities
полиномиальная сложность
Wikipedia
P (complexity)
In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class. It contains all decision problems that can be solved by a deterministic Turing machine using a polynomial amount of computation time, or polynomial time.
Cobham's thesis holds that P is the class of computational problems that are "efficiently solvable" or "tractable". This is inexact: in practice, some problems not known to be in P have practical solutions, and some that are in P do not, but this is a useful rule of thumb.
